Weak Approximation for Tori Over p-adic Function Fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WEAK APPROXIMATION FOR TORI OVER p-ADIC FUNCTION FIELDS

We study local-global questions for Galois cohomology over the function field of a curve defined over a p-adic field, the main focus being weak approximation of rational points. We construct a 9-term Poitou–Tate type exact sequence for tori over a field as above (and also a 12-term sequence for finite modules). Like in the number field case, part of the sequence can then be used to analyze the ...

متن کامل

Weak Approximation over Function Fields

— We prove that rationally connected varieties over the function field of a complex curve satisfy weak approximation for places of good reduction.

متن کامل

HILBERT’S TENTH PROBLEM FOR FUNCTION FIELDS OF VARIETIES OVER NUMBER FIELDS AND p-ADIC FIELDS

Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n ≥ 1 over k. Then Hilbert’s Tenth Problem for L is undecidable. In particular, Hilbert’s Tenth Problem for function fields of varieties over number fields of dimension ≥ 1 is undecidable.

متن کامل

Weak Approximation and R-equivalence over Function Fields of Curves

For a rationally connected fibration over a complex curve, and for a closed point of the curve, we prove that every power series section of the fibration near the point is approximated to arbitrary order by polynomial sections provided the “Laurent fiber”, i.e., the deleted power series neighborhood of the fiber, as a variety over the Laurent series field is R-connected – the analogue of ration...

متن کامل

Factoring Polynominals over p-Adic Fields

We give an efficient algorithm for factoring polynomials over finite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2014

ISSN: 1687-0247,1073-7928

DOI: 10.1093/imrn/rnu019